Relating Hierarchy of Linear Temporal Properties to Model Checking Relating Hierarchy of Linear Temporal Properties to Model Checking

The hierarchy of properties as overviewed by Manna and Pnueli 23] relates language, topology, !-automata, and linear temporal logic classiications of properties. We provide new characterisations of this hierarchy in terms of automata with B uchi, coB uchi, and Streett acceptance condition and in terms of LTL i and LTL i hierarchies. Afterwards, we analyse the complexity of the model checking problem for particular classes of the hierarchy and thanks to the new characterisations we identify those linear time temporal properties for which the model checking problem can be solved more efciently than in the general case.